An efficient method to solve least-cost minimum spanning tree (LC-MST) problem
نویسندگان
چکیده
منابع مشابه
The Iterative Minimum Cost Spanning Tree Problem
The minimum cost spanning tree problem consists in constructing a network of minimum cost that connects all agents to the source and distributes the cost among the agents in a fair way. We develop a framework for the iterative minimum cost spanning tree problem. In the iterative setting, agents arrive over time and desire to be connected to a source in different rounds in order to receive a ser...
متن کاملMinimum Cost Spanning Tree MCST problem
Originally studied for designing min cost connecting grid (in distribution, transportation, communication applications) to connect a set of cities. Under arc lengths > 0 min cost connecting network will bea spanning tree (ST). Earliest algo. (Boruvka's) dates back to 1926! Undirected, connected G = (N A c). To nd an uncon-strained MCST in G. c arbitrary. Constrained MCST problems (typical const...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملGeometric Minimum Diameter Minimum Cost Spanning Tree Problem
In this paper we consider bi-criteria geometric optimization problems, in particular, the minimum diameter minimum cost spanning tree problem and the minimum radius minimum cost spanning tree problem for a set of points in the plane. The former problem is to construct a minimum diameter spanning tree among all possible minimum cost spanning trees, while the latter is to construct a minimum radi...
متن کاملAn Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks
The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2012
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2011.12.001